Ordered Treemap Layouts

نویسندگان

  • Ben Shneiderman
  • Martin Wattenberg
چکیده

Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dynamically changing data, and fail to preserve an ordering of the underlying data. This paper introduces the ordered treemap, which addresses these two shortcomings. The ordered treemap algorithm ensures that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials, we show that compared to other layout algorithms ordered treemaps are more stable while maintaining relatively low aspect ratios of the constituent rectangles. A second test set uses stock market data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Poster: Exploration of the 3D Treemap Design Space

Inspired by Venn diagram layouts, the Treemap [6] is one of the most prevalent implicit tree visualization techniques. Ever since its publication, it has been modified and extended in many ways. This work presents a way to generate 3-dimensional Treemap visualizations by a 4-step procedure. It can be used for rapid prototyping and comparing different 3D Treemap layout approaches, to devise user...

متن کامل

Ordered and Unordered Treemap Algorithms and Their Applications on Handheld Devices

This thesis describes a way to visualize hierarchical structures on PDAs using Treemaps. A new ordered layout algorithm for treemaps, called Split Layout, is presented. Traditionally, treemap algorithms have exhibited a trade off between good aspect ratio and ordered layout. The new Split Layout is compared to five published treemap algorithms. Properties such as avarage aspect ratio, stability...

متن کامل

Exploring Road Incident Data with Heat Maps

This research seeks to determine whether heat mapping is an effective technique for the visual exploration of road incident data. Four software prototypes, which adopted map, treemap and spatial treemap layouts, were developed using open source software. Whilst the visualization process described by Fry (2007) informed the development effort, the evaluation methodology was based on the Nested P...

متن کامل

Adjacency-Preserving Spatial Treemaps

Abstract. Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn s...

متن کامل

Quantum Treemaps and Bubblemaps for a Zoomable Image Browser

This paper describes two algorithms for laying out groups of objects in a 2D space-filling manner. Quantum Treemaps are a variation on existing treemap algorithms that are designed for laying out images or other objects of indivisible (quantum) size. They build on the Ordered Treemap algorithm, but guarantees that every generated rectangle will have a width and height that are an integral multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001